State Transition Simulated Annealing Algorithm for Discrete-Continuous Optimization Problems
نویسندگان
چکیده
منابع مشابه
Discrete state transition algorithm for unconstrained integer optimization problems
we focus on a recently new intelligent optimization algorithm called discrete state transition algorithm, for solving integer optimization problems. Firstly, we summarize some key elements for discrete state transition algorithm to guide its well development. Several intelligent operators are designed for local exploitation and global exploration. Then, a dynamic adjustment strategy “risk and r...
متن کاملParallel Continuous Simulated Annealing for Global Optimization
In this paper a parallel algorithm for simulated annealing (S.A.) in the continuous case, the Multiple Trials and Adaptive Supplementary Search, MTASS algorithm, is presented. It is based on a combination of multiple trials, local improved searchs and an adaptive cooling schedule. The results in optimizing some standard test problems are compared with a sequential S.A. algorithms and another pa...
متن کاملCombined Simulated Annealing and Genetic Algorithm to Solve Optimization Problems
Combinatorial optimization problems arise in many scientific and practical applications. Therefore many researchers try to find or improve different methods to solve these problems with high quality results and in less time. Genetic Algorithm (GA) and Simulated Annealing (SA) have been used to solve optimization problems. Both GA and SA search a solution space throughout a sequence of iterative...
متن کاملCombined Simulated Annealing and Genetic Algorithm to Solve Optimization Problems
Combinatorial optimization problems arise in many scientific and practical applications. Therefore many researchers try to find or improve different methods to solve these problems with high quality results and in less time. Genetic Algorithm (GA) and Simulated Annealing (SA) have been used to solve optimization problems. Both GA and SA search a solution space throughout a sequence of iterative...
متن کاملportfolio optimization with simulated annealing algorithm
the markowitz issue of optimization can’t be solved by precise mathematical methods such as second order schematization, when real world condition and limitations are considered. on the other hand, most managers prefer to manage a small portfolio of available assets in place of a huge portfolio. it can be analogized to cardinal constrains, that is, constrains related to minimum and maximum curr...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Access
سال: 2019
ISSN: 2169-3536
DOI: 10.1109/access.2019.2908961